Optimization of Service Time and Memory Space in a Self Stabilizing Token Circulation Protocol on Anonymous Unidirectional Rings
نویسنده
چکیده
We present a self stabilizing token circulation protocol on unidirectional anonymous rings This protocol does not required processor identi ers no distinguished processor i e all processors perform the same algorithm The algorithm can deal with any kind of schedulings even unfair ones Our protocol is a randomized self stabilizing meaning that starting from an arbitrary con guration in response to an arbitrary perturbation modifying the memory state it reaches with probability a legitimate con guration i e a con guration with only one token in the network Once the system is stabilized the circulation of the sole token is fair i e in every round every processor obtains the token once N token circulations are done in at most N computation steps where N is the ring size The memory space required by our algorithm on each processor O MN MN being the smallest non divisor of ring size In BGJ a it was been proven that the minimal memory space required by a self stabilizing token circulation under any unfair distributed scheduler is O MN Previ ous randomized self stabilizing token circulation protocols design to work under unfair distributed schedulers require O N memory space or they have not bound on the service time i e duration of a token round Thus we present the rst protocol having the two major advantages a bounded service time and optimal in memory space
منابع مشابه
Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings
We present a self-stabilizing token circulation protocol on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm). The protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), i...
متن کاملService Time of Self-Stabilizing Token Circulation Protocol on Anonymous Unidirectional Rings - Extended Abstract -
Our protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), it reaches (with probability 1) a legitimate configuration (i.e. a configuration with only one token in the network). Once the system is stabilized the circulation of the sole token is 1-fair (i.e. in every round, every proce...
متن کاملService Time of Self - Stabilizing Token Circulation Protocol on Anonymous Unidirectional Rings - Extended
Our protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), it reaches (with probability 1) a legitimate configuration (i.e. a configuration with only one token in the network). Once the system is stabilized the circulation of the sole token is 1-fair (i.e. in every round, every proce...
متن کاملOptimal Self-stabilizing Mutual Exclusion on Synchronous Rings
We propose several self-stabilizing protocols for unidirectional, anonymous, and uniform synchronous rings of arbitrary size, where processors communicate by exchanging messages. When the size of the ring n is unknown, we better the service time by a factor of n (performing the best possible complexity for the stabilization time and the memory consumption). When the memory size is known, we pre...
متن کاملSelf-Stabilizing Token Circulation on Anonymous Message Passing Rings
A self-stabilizing algorithm that solves the problems of token circulation and leader election on anonymous and uniform, unidirectional, message passing rings of arbitrary, but known, size is developed. From any initial configuration, the expected time to stabilization on a ring of size n is in O(n log n). Furthermore, the size of the configuration of the system remains constant throughout the ...
متن کامل